基于遗传算法的整周模糊度OTF解算

建立了一种基于简单遗传算法的改进模糊度搜索方法。首先采用一组约束方程求解模糊度浮点数解 ,然后UDUT 和LDLT 分解对整周模糊度进行整数高斯变换以降低各整周模糊度之间的相关性 ,最后利用遗传算法进行整周模糊度搜索。在种群个体较少的情况下 ,为了避免早熟使搜索陷入局部最优 ,提出两种变异算子 ,保持个体的多样性。仿真结果表明改进后的算法能够实时动态解算整周模糊度 ,且较使用简单遗传算法具有更快的搜索速度和鲁棒性。     

协方差压缩感知逆合成孔径雷达成像技术

为解决低信噪比条件下短观测时间雷达成像问题,提出一种基于回波协方差矩阵处理的压缩感知逆合成孔径雷达成像技术。该方法构建了回波协方差矩阵层面下的压缩感知问题模型,并通过特定的线性变换降低环境噪声对成像结果的影响。在仿真实验中,通过处理短观测时间和低信噪比条件下的模拟回波数据,该方法获得比传统压缩感知方法像质更好、对比度更强的目标成像结果。同时,其成像结果的目标背景比和背景噪声能量两个雷达图像评价指标都优于传统方法,进一步验证了该方法的有效性。     

WENO格式权重分析与改进

为了优化WENO格式计算性能,在对Jiang和Shu的经典WENO格式(记为WENO-JS)加权方法分析的基础上,通过引入间接光滑指数,构造出一种新的WENO格式——WENO-E格式,取得减小间断区耗散的效果。理论分析表明,该格式与WENO-JS格式计算效率基本相同,可达到相同阶的计算精度;但在相同网格下,较之WENO-JS格式,该格式对光滑区域的求解有更小的截断误差,对间断的捕捉有更高的分辨率。与WENO-JS格式相比,采用WENO-E格式进行线性迁移方程、非线性Burgers方程、欧拉方程等相关问题的数值实验,均能取得更好的数值结果。     

The one‐warehouse multiretailer problem with an order‐up‐to level inventory policy

We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

加权模糊C均值聚类算法实现BDS三频组合观测值优选

在对BDS三频载波相位组合观测值进行误差分析的基础上，确定了优选载波相位线性组合系数的筛选标准。针对传统聚类算法在高维多频混合数据集分类中存在的不足，采用一种基于加权的模糊C均值聚类算法，通过对同一维度在不同簇上赋予不同的权重值，对传统遍历搜索法所获得的部分BDS三频载波相位组合观测值进行了优化分类选取，有效解决了传统全球导航卫星系统载波相位观测值选取方法效率低的问题，同时为多系统多频数据组合观测值系数的优化选取提供了一种新的思路。对分类结果进行分析，确定了各类组合观测量的适用范围，并结合实测数据，利用无几何层叠模糊度解算方法对优选组合进行了整周模糊度的解算，结果验证了该方法的可行性。     

Approximation algorithms for sequential batch‐testing of series systems

We introduce and study a generalization of the classic sequential testing problem, asking to identify the correct state of a given series system that consists of independent stochastic components. In this setting, costly tests are required to examine the state of individual components, which are sequentially tested until the correct system state can be uniquely identified. The goal is to propose a policy that minimizes the expected testing cost, given a‐priori probabilistic information on the stochastic nature of each individual component. Unlike the classic setting, where variables are tested one after the other, we allow multiple tests to be conducted simultaneously, at the expense of incurring an additional set‐up cost. The main contribution of this article consists in showing that the batch testing problem can be approximated in polynomial time within factor , for any fixed . In addition, we explain how, in spite of its highly nonlinear objective function, the batch testing problem can be formulated as an approximate integer program of polynomial size, while blowing up its expected cost by a factor of at most . Finally, we conduct extensive computational experiments, to demonstrate the practical effectiveness of these algorithms as well as to evaluate their limitations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 275–286, 2016     

利用卷积神经网络的太赫兹孔径编码增强成像

针对现有太赫兹孔径编码成像算法鲁棒性较差、计算求解复杂度较高等问题,提出基于卷积神经网络的太赫兹孔径编码增强成像方法.该方法通过构建一个端到端的神经网络来实现成像系统的隐式建模,利用网络强大的求逆能力和抗噪性能来实现低信噪比下的目标重构.通过仿真实验可以看出,该方法可以在不同信噪比下实现对不同稀疏度目标的重构.另外,与...     

A multilevel passenger screening problem for aviation security

Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

激光辐射方位的确定技术

介绍了确定来袭激光束方位的成像技术、时间延迟技术和屏蔽技术的基本原理和发展现状;分析了3种技术的优缺点;探讨了来袭激光方位确定技术的发展方向.     

A novel modeling approach for express package carrier planning

Express package carrier networks have large numbers of heavily‐interconnected and tightly‐constrained resources, making the planning process difficult. A decision made in one area of the network can impact virtually any other area as well. Mathematical programming therefore seems like a logical approach to solving such problems, taking into account all of these interactions. The tight time windows and nonlinear cost functions of these systems, however, often make traditional approaches such as multicommodity flow formulations intractable. This is due to both the large number of constraints and the weakness of the linear programming (LP) relaxations arising in these formulations. To overcome these obstacles, we propose a model in which variables represent combinations of loads and their corresponding routings, rather than assigning individual loads to individual arcs in the network. In doing so, we incorporate much of the problem complexity implicitly within the variable definition, rather than explicitly within the constraints. This approach enables us to linearize the cost structure, strengthen the LP relaxation of the formulation, and drastically reduce the number of constraints. In addition, it greatly facilitates the inclusion of other stages of the (typically decomposed) planning process. We show how the use of templates, in place of traditional delayed column generation, allows us to identify promising candidate variables, ensuring high‐quality solutions in reasonable run times while also enabling the inclusion of additional operational considerations that would be difficult if not impossible to capture in a traditional approach. Computational results are presented using data from a major international package carrier. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008